A Constructive Proof for the Induction of M-convex Functions through Networks
نویسنده
چکیده
Murota (1995) introduced an M-convex function as a quantitative generalization of the set of integral vectors in an integral base polyhedron as well as an extension of valuated matroid over base polyhedron. Just as a base polyhedron can be transformed through a network, an M-convex function can be induced through a network. This paper gives a constructive proof for the induction of an M-convex function. The proof is based on the correctness of a simple algorithm, which nds an exchangeable element. We also analyze a behavior of induced functions when they take the value 1:
منابع مشابه
An Algorithmic Proof for the Induction of M-convex Functions through Networks
Quite recently, Murota introduced an M-convex function as a quantitative generalization of the set of integral points in a base polyhedron, as well as an extension of valuated matroid over base polyhedron. Just as a base polyhedron can be transformed through a network, an M-convex function can be induced through a network. This paper gives an algorithmic proof for the induction of an M-convex f...
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملOn Fejér Type Inequalities for (η1,η2)-Convex Functions
In this paper we find a characterization type result for (η1,η2)-convex functions. The Fejér integral inequality related to (η1,η2)-convex functions is obtained as a generalization of Fejér inequality related to the preinvex and η-convex functions. Also some Fejér trapezoid and midpoint type inequalities are given in the case that the absolute value of the derivative of considered function is (...
متن کاملConstructive Proof of Tychonoff’s Fixed Point Theorem for Sequentially Locally Non-Constant Functions
We present a constructive proof of Tychonoff’s fixed point theorem in a locally convex space for uniformly continuous and sequentially locally non-constant functions. Keywords—sequentially locally non-constant functions, Tychonoff’s fixed point theorem, constructive mathematics.
متن کاملInterpolation of the tabular functions with fuzzy input and fuzzy output
In this paper, rst a design is proposed for representing fuzzy polynomials withinput fuzzy and output fuzzy. Then, we sketch a constructive proof for existenceof such polynomial which can be fuzzy interpolation polynomial in a set given ofdiscrete points rather than a fuzzy function. Finally, to illustrate some numericalexamples are solved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 82 شماره
صفحات -
تاریخ انتشار 1998